People's War? Self-Interest,Coercion and Ideology in Nepal's Maoist Insurgency

This paper analyses the micro-level processes by which ordinary rural Nepalis came to support the Maoist insurgency. Working through the implications of orthodox collective action theory, it finds that Maoist cadres are unlikely to have been strongly motivated by considerations of acquisitive self-interest. However, the participation of many may have been partly secured through various forms of coercion. Non-instrumental motivations for participation that are not accounted for by the rational choice premises that underpin conventional collective action theory are also identified. These are found to have been of particular significance in the violent and uncertain context of contemporary Nepal.     

Maintaining peace in a neighbourhood torn by separatism: the case of Satun province in southern Thailand

While separatist-related conflict has re-emerged in southern Thailand, there is one predominantly Muslim border province that has remained outside of the conflict. Satun province has been conspicuously unaffected by the Malay-Muslim separatist movement, despite its shared history and ethnic origins with the conflict-affected provinces. In contrast to Pattani, Yala, and Narathiwat, the process of state penetration in Satun was gradual and comparatively less coercive, leading to relative stability and encouraging political and economic integration. This comparative study analyzes the history of cooperative state–minority relations and political stability in Satun province, and draws important lessons directly applicable to the unrest in neighbouring provinces.     

An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs

In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc.     

Criteria and approximate methods for path-constrained moving-target search problems

A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher must choose one cell in which to search in each time period. The set of cells available for search depends upon the cell chosen in the last time period. The problem is to find a search path, i.e., a sequence of search cells, that either maximizes the probability of detection or minimizes the mean number of time periods required for detection. The search problem is modelled as a partially observable Markov decision process and several approximate solutions procedures are proposed. © 1995 John Wiley & Sons, Inc.     

Employment and utilization of engineers among defense contractors

Defense contractors retain engineers for two reasons. First, engineers work on current-period production contracts. Second, engineers conduct independent research and development (IR&D) and write bids and proposals (B&P) for future contracts. The amount of IR&D/B&P activity, however, understates the amount of effort devoted to learning that reduces the cost of future production. Even some engineers who work on current-period production may engage in learning, as a by-product of their efforts. This article develops and implements a model for estimating the volume of learning activity undertaken by four large manufacturers of military aircraft. © 1994 John Wiley & Sons, Inc.